TSTP Solution File: PUZ137^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ137^1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:49:26 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 310 ( 63 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 267 ( 78 ~; 59 |; 0 &; 99 @)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 10 usr; 11 con; 0-2 aty)
% ( 9 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 27 ( 12 ^ 12 !; 2 ?; 27 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
says: $i > $o > $o ).
thf(func_def_12,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f103,plain,
$false,
inference(avatar_sat_refutation,[],[f43,f48,f84,f85,f102]) ).
thf(f102,plain,
( spl1_3
| ~ spl1_4
| ~ spl1_5 ),
inference(avatar_contradiction_clause,[],[f101]) ).
thf(f101,plain,
( $false
| spl1_3
| ~ spl1_4
| ~ spl1_5 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f96,plain,
( ( $true = $false )
| spl1_3
| ~ spl1_4
| ~ spl1_5 ),
inference(superposition,[],[f93,f42]) ).
thf(f42,plain,
( ( sK3 = $true )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl1_4
<=> ( sK3 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
thf(f93,plain,
( ( sK3 = $false )
| spl1_3
| ~ spl1_5 ),
inference(subsumption_resolution,[],[f92,f37]) ).
thf(f37,plain,
( ( $false != sK0 )
| spl1_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f36,plain,
( spl1_3
<=> ( $false = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
thf(f92,plain,
( ( sK3 = $false )
| ( $false = sK0 )
| ~ spl1_5 ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f90,plain,
( ( sK3 != sK0 )
| ~ spl1_5 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
( ( sK3 != sK0 )
| ( $true != $true )
| ~ spl1_5 ),
inference(constrained_superposition,[],[f12,f47]) ).
thf(f47,plain,
( ( $true
= ( says @ peter @ sK3 ) )
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl1_5
<=> ( $true
= ( says @ peter @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
thf(f12,plain,
( ( says @ peter @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( says @ peter @ sK0 )
!= $true ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: $o] :
( ( says @ peter @ X0 )
!= $true )
=> ( ( says @ peter @ sK0 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: $o] :
( ( says @ peter @ X0 )
!= $true ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
~ ! [X0: $o] :
( ( says @ peter @ X0 )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ! [X0: $o] : ( says @ peter @ X0 ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X0: $o] : ( says @ peter @ X0 ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
! [X0: $o] : ( says @ peter @ X0 ),
file('/export/starexec/sandbox2/tmp/tmp.DSRiZJGgDv/Vampire---4.8_6818',thm) ).
thf(f85,plain,
( spl1_2
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f55,f36,f32]) ).
thf(f32,plain,
( spl1_2
<=> ! [X1: $o] :
( ( $false = X1 )
| ( $false
= ( says @ peter @ X1 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f55,plain,
( ! [X1: $o] :
( ( $false = X1 )
| ( $false
= ( says @ peter @ X1 ) ) )
| ~ spl1_3 ),
inference(not_proxy_clausification,[],[f54]) ).
thf(f54,plain,
( ! [X1: $o] :
( ( $false
= ( says @ peter @ X1 ) )
| ( $true = ~ X1 ) )
| ~ spl1_3 ),
inference(binary_proxy_clausification,[],[f53]) ).
thf(f53,plain,
( ! [X1: $o] :
( $true
= ( ( says @ peter @ X1 )
=> ~ X1 ) )
| ~ spl1_3 ),
inference(beta_eta_normalization,[],[f52]) ).
thf(f52,plain,
( ! [X1: $o] :
( ( ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 )
@ X1 )
= $true )
| ~ spl1_3 ),
inference(pi_clausification,[],[f51]) ).
thf(f51,plain,
( ( $false
!= ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( $true != $true )
| ( $false
!= ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
| ~ spl1_3 ),
inference(constrained_superposition,[],[f49,f13]) ).
thf(f13,plain,
( ( says @ peter
@ ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( ( says @ peter
@ ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
= $true ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
( says @ peter
@ ! [X0: $o] :
( ( says @ peter @ X0 )
=> ~ X0 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( says @ peter
@ ! [X0: $o] :
( ( says @ peter @ X0 )
=> ~ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.DSRiZJGgDv/Vampire---4.8_6818',ax1) ).
thf(f49,plain,
( ( ( says @ peter @ $false )
!= $true )
| ~ spl1_3 ),
inference(superposition,[],[f12,f38]) ).
thf(f38,plain,
( ( $false = sK0 )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f84,plain,
( ~ spl1_2
| ~ spl1_3 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f83,plain,
( $false
| ~ spl1_2
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f77,f82]) ).
thf(f82,plain,
( ( sK4 = $false )
| ~ spl1_2 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( $true = $false )
| ( sK4 = $false )
| ~ spl1_2 ),
inference(superposition,[],[f33,f64]) ).
thf(f64,plain,
( ( $true
= ( says @ peter @ sK4 ) )
| ~ spl1_2 ),
inference(binary_proxy_clausification,[],[f62]) ).
thf(f62,plain,
( ( ( ( says @ peter @ sK4 )
=> ~ sK4 )
= $false )
| ~ spl1_2 ),
inference(beta_eta_normalization,[],[f61]) ).
thf(f61,plain,
( ( ( ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 )
@ sK4 )
= $false )
| ~ spl1_2 ),
inference(sigma_clausification,[],[f60]) ).
thf(f60,plain,
( ( $false
= ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
| ~ spl1_2 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( $true = $false )
| ( $false
= ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
| ~ spl1_2 ),
inference(superposition,[],[f13,f33]) ).
thf(f33,plain,
( ! [X1: $o] :
( ( $false
= ( says @ peter @ X1 ) )
| ( $false = X1 ) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f77,plain,
( ( sK4 != $false )
| ~ spl1_2
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
( ( sK4 != $false )
| ( $true != $true )
| ~ spl1_2
| ~ spl1_3 ),
inference(constrained_superposition,[],[f49,f64]) ).
thf(f48,plain,
( spl1_5
| spl1_3 ),
inference(avatar_split_clause,[],[f21,f36,f45]) ).
thf(f21,plain,
( ( $true
= ( says @ peter @ sK3 ) )
| ( $false = sK0 ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ( $false = sK0 )
| ( ( ( says @ peter @ sK3 )
=> ~ sK3 )
= $false ) ),
inference(beta_eta_normalization,[],[f18]) ).
thf(f18,plain,
( ( $false = sK0 )
| ( ( ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 )
@ sK3 )
= $false ) ),
inference(sigma_clausification,[],[f17]) ).
thf(f17,plain,
( ( $false
= ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) ) )
| ( $false = sK0 ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) )
!= sK0 ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f14,plain,
( ( ( !! @ $o
@ ^ [Y0: $o] :
( ( says @ peter @ Y0 )
=> ~ Y0 ) )
!= sK0 )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f12,f13]) ).
thf(f43,plain,
( spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f22,f40,f36]) ).
thf(f22,plain,
( ( sK3 = $true )
| ( $false = sK0 ) ),
inference(not_proxy_clausification,[],[f20]) ).
thf(f20,plain,
( ( $false = sK0 )
| ( $false = ~ sK3 ) ),
inference(binary_proxy_clausification,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PUZ137^1 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n006.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 18:01:07 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.30 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.DSRiZJGgDv/Vampire---4.8_6818
% 0.15/0.32 % (6928)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.32 % (6927)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.32 % (6929)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.32 % (6926)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.32 % (6930)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.32 % (6933)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.32 % (6931)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.32 % (6932)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.15/0.32 % (6928)Refutation not found, incomplete strategy
% 0.15/0.32 % (6928)------------------------------
% 0.15/0.32 % (6928)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (6931)Refutation not found, incomplete strategy
% 0.15/0.32 % (6931)------------------------------
% 0.15/0.32 % (6931)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (6931)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32 % (6929)Refutation not found, incomplete strategy
% 0.15/0.32 % (6929)------------------------------
% 0.15/0.32 % (6929)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32
% 0.15/0.32 % (6929)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (6931)Memory used [KB]: 5373
% 0.15/0.32 % (6929)Memory used [KB]: 5500
% 0.15/0.32 % (6931)Time elapsed: 0.002 s
% 0.15/0.32 % (6929)Time elapsed: 0.002 s
% 0.15/0.32 % (6931)Instructions burned: 1 (million)
% 0.15/0.32 % (6929)Instructions burned: 1 (million)
% 0.15/0.32 % (6931)------------------------------
% 0.15/0.32 % (6931)------------------------------
% 0.15/0.32 % (6929)------------------------------
% 0.15/0.32 % (6929)------------------------------
% 0.15/0.32 % (6928)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (6928)Memory used [KB]: 5500
% 0.15/0.32 % (6928)Time elapsed: 0.003 s
% 0.15/0.32 % (6928)Instructions burned: 1 (million)
% 0.15/0.32 % (6928)------------------------------
% 0.15/0.32 % (6928)------------------------------
% 0.15/0.32 % (6930)Refutation not found, incomplete strategy
% 0.15/0.32 % (6930)------------------------------
% 0.15/0.32 % (6930)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (6930)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (6930)Memory used [KB]: 5500
% 0.15/0.32 % (6930)Time elapsed: 0.002 s
% 0.15/0.32 % (6930)Instructions burned: 1 (million)
% 0.15/0.32 % (6930)------------------------------
% 0.15/0.32 % (6930)------------------------------
% 0.15/0.32 % (6933)Refutation not found, incomplete strategy
% 0.15/0.32 % (6933)------------------------------
% 0.15/0.32 % (6933)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (6933)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (6933)Memory used [KB]: 5500
% 0.15/0.32 % (6933)Time elapsed: 0.002 s
% 0.15/0.32 % (6933)Instructions burned: 1 (million)
% 0.15/0.32 % (6933)------------------------------
% 0.15/0.32 % (6933)------------------------------
% 0.15/0.32 % (6927)Refutation not found, incomplete strategy
% 0.15/0.32 % (6927)------------------------------
% 0.15/0.32 % (6927)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (6927)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (6927)Memory used [KB]: 5500
% 0.15/0.32 % (6927)Time elapsed: 0.003 s
% 0.15/0.32 % (6927)Instructions burned: 2 (million)
% 0.15/0.32 % (6927)------------------------------
% 0.15/0.32 % (6927)------------------------------
% 0.15/0.32 % (6926)First to succeed.
% 0.15/0.32 % (6932)Also succeeded, but the first one will report.
% 0.15/0.32 % (6926)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for Vampire---4
% 0.15/0.32 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.32 % (6926)------------------------------
% 0.15/0.32 % (6926)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (6926)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (6926)Memory used [KB]: 5500
% 0.15/0.32 % (6926)Time elapsed: 0.005 s
% 0.15/0.32 % (6926)Instructions burned: 4 (million)
% 0.15/0.32 % (6926)------------------------------
% 0.15/0.32 % (6926)------------------------------
% 0.15/0.32 % (6925)Success in time 0.014 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------